A note on hypergraph connectivity augmentation
نویسندگان
چکیده
We prove an abstract version of an edge-splitting theorem for directed hypergraphs that appeared in [1], and use this result to obtain min-max theorems on hypergraph augmentation problems that are linked to orientations. These problems include (k, l)-edge-connectivity augmentation of directed hypergraphs, and (k, l)-partition-connectivity augmentation of undirected hypergraphs by uniform hyperedges.
منابع مشابه
Hypergraph connectivity augmentation
The hypergraph augmentation problem is to augment a hypergraph by hyperedges to meet prescribed local connectivity requirements. We provide here a minimax theorem for this problem. The result is derived from the degree constrained version of the problem by a standard method. We shall construct the required hypergraph for the latter problem by a greedy type algorithm. A similar minimax result wi...
متن کاملCovering symmetric supermodular functions by graphs
The minimum number of edges of an undirected graph covering a symmetric , supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation. 0. INTRODUCTION T. Watanabe and A. Nakamura 1987] proved a min-max formula for the minimum number of new edges whose addition to a given undirected graph...
متن کاملAugmenting the edge-connectivity of a hypergraph by adding a multipartite graph
Given a hypergraph, a partition of its vertex set and an integer k, find a minimum number of graph edges to be added between different members of the partition in order to make the hypergraph k-edge-connected. This problem is a common generalization of the following two problems: edge-connectivity augmentation of graphs with partition constraints (J. Bang-Jensen, H. Gabow, T. Jordán, Z. Szigeti...
متن کاملEdge-connectivity of undirected and directed hypergraphs
The objective of the thesis is to discuss edge-connectivity and related connectivity conceptsin the context of undirected and directed hypergraphs. In particular, we focus on k-edge-connectivity and (k, l)-partition-connectivity of hypergraphs, and (k, l)-edge-connectivityof directed hypergraphs. A strong emphasis is placed on the role of submodularity in thestructural aspects o...
متن کاملLocal edge-connectivity augmentation in hypergraphs is NP-complete
We consider a local edge-connectivity hypergraph augmentation problem. Specifically, we are given a hypergraph G = (V, E) and a subpartition of V . We are asked to find the smallest possible integer γ, for which there exists a set of size-two edges F , with |F | = γ, such that in G′ = (V,E ∪ F ), the local edge-connectivity between any pair of vertices lying in the same set in the subpartition ...
متن کامل